Competitive distributed file allocation

Distributed Resource Allocation in Competitive Wireless Networks

File Allocation in Distributed Databases with Interaction between Files

In this paper, we re-examine the file allocation problem. Because of changing technology, the assumptions we use here are different from those of previous researchers. Specifically, the interaction of files during processing of queries is explicitly incorperated into our model and the cost of communication between two sites is dominated by the amount of data transfer and is independent of the r...

Distributed File Recovery on the Lustre Distributed File System

With the advancement of cloud-computing technologies and the growth in distributed software applications, a great deal of research that has been focused on the concepts and implementations of distributed file systems to support these application. Since its inception in 1999 by Peter Braam at Carnegie Mellon University, the Lustre distributed file system has gained both the technical, as well as...

Competitive Repeated Allocation without Payments

We study the problem of allocating a single item repeatedly among multiple competing agents, in an environment where monetary transfers are not possible. We design (Bayes-Nash) incentive compatible mechanisms that do not rely on payments, with the goal of maximizing expected social welfare. We first focus on the case of two agents. We introduce an artificial payment system, which enables us to ...

A Competitive Rate Allocation Game

We introduce a competitive rate allocation game in which two receivers compete to forward the data from a transmitter to a destination in exchange for a payment proportional to the amount of forwarded data. At each time slot the channel from the transmitter to each receiver is an independent random variable with two states, high or low, affecting the amount of data that can be transmitted. Rece...